Generating and Displaying Progressive Meshes

نویسندگان

  • Swen Campagna
  • Hans-Peter Seidel
چکیده

Triangle meshes are a common representation for geometric shapes in computer graphics. However, limited transmission bandwidth disables quick preview of detailed models when represented in standard formats. In this paper, we validate the Progressive Mesh (PM) representation as a compact , lossless, and hierarchical format that enables a broad range of applications, for example , mesh reduction or simpliication, Levels-of-Detail, continuous hierarchies, load adaptive display , view-dependent rendering, or progressive transmission. We generalize the concept of PMs to be compatible to arbitrary mesh simpliication algorithms that only have to meet some requirements. We present a modiied version of the original algorithm for generating PMs. Finally, we discuss our implementation of a PM viewer as an ActiveX control that allows interactive display of PMs on a standard PC. This application can be used fully transparent for the user within WWW browsers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplification of Arbitrary Polyhedral Meshes

Surface models containing billions of polygons are becoming more frequent in computer graphics. Mesh simplification is necessary for displaying such surfaces at interactive rates. We describe a novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration. Unlike previous work on mesh simplification, our method ...

متن کامل

Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes

This paper is concerned with the description of an algorithm for generating the B-nets of box splines and an algorithm based on subdivision of these B-nets for graphically displaying spline surfaces on a three-or four-directional mesh. The combination of these two algorithms is shown to compare favorably over the other existing algorithms for this purpose. 0 1 x1. Introduction It is well known ...

متن کامل

A Simulated Annealing Algorithm for Progressive Mesh Optimization

This paper presents a novel progressive mesh model based on collapse tree, which can accomplish the disordered expansions and collapses of the simplified mesh and is able to restore the mesh just in a specific area. With arbitrary collapse and expansion, we design an edge collapse algorithm for mesh optimization. Its summary process can be described as follows: generating a series of new simpli...

متن کامل

Progressive Lossless Mesh Compression Via Incremental Parametric Refinement

In this paper, we propose a novel progressive lossless mesh compression algorithm based on Incremental Parametric Refinement, where the connectivity is uncontrolled in a first step, yielding visually pleasing meshes at each resolution level while saving connectivity information compared to previous approaches. The algorithm starts with a coarse version of the original mesh, which is further ref...

متن کامل

Simplification and Real-time Smooth Transitions of Articulated Meshes

Simplification techniques have mainly been applied on static models. However in movie and game industries, many models are designed to be animated. We extend the progressive mesh technique to handle skeletallyarticulated meshes in order to obtain a continuous levelof-detail (CLOD) representation that retains its ability to be animated. Our technique is not limited to any simplification metric, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997